Network flow problem - PDFSEARCH.IO - Document Search Engine

Network flow problem
Results: 219

#	Item
61	Optimization Algorithms Lecture 23: Maximum Flows and Minimum Cuts [Fa’13] Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:41:28 Combinatorics Maximum flow problem Ford–Fulkerson algorithm Flow network Edmonds–Karp algorithm Max-flow min-cut theorem Minimum cut Cut Graph Network flow Graph theory Mathematics
62	MINIMUM REJECTION SCHEDULING IN ALL-PHOTONIC NETWORKS Nahid Saberi and Mark J. Coates Department of Electrical and Computer Engineering McGill University Montreal, QC, Canada E-mail: , coates@e Add to Reading List Source URL: www.tsp.ece.mcgill.ca Language: English - Date: 2006-07-13 16:30:06 Theoretical computer science Linear programming Scheduling Routing and wavelength assignment Mathematical optimization Max-min fairness Maximum flow problem Flow network Connectivity Operations research Mathematics Applied mathematics
63	9 On the Power of Belief Propagation: A Constraint Propagation Perspective R. D ECHTER , B. B IDYUK , R. M ATEESCU Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2012-01-25 15:39:31 Local consistency Probability theory Bayesian statistics Statistical models Belief propagation Bayesian network Tree decomposition Constraint satisfaction problem Flow network Graph theory Constraint programming Graphical models
64	ICS 260 – Fall 2001 – First Midterm Name: Student ID: 1: Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2001-10-18 19:06:29 Network flow Maximum flow problem Flow network Matching Shortest path problem Distance Circulation problem Graph Breadth-first search Graph theory Mathematics Theoretical computer science
65	System Area Network Mapping Alan M. Mainwaring Brent N. Chun Saul Schleimer Daniel S. Wilkerson Add to Reading List Source URL: daniel-wilkerson.appspot.com Language: English Routing algorithms Network flow Network theory Shortest path problem Routing Maximum flow problem Floyd–Warshall algorithm Graph Network topology Graph theory Mathematics Theoretical computer science
66	Near Linear-Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs Guy E. Blelloch Anupam Gupta Ioannis Koutis† Gary L. Miller Richard Peng Kanat Tangwongsan Carnegie Mellon University and † Add to Reading List Source URL: ccom.uprrp.edu Language: English - Date: 2011-03-31 22:48:01 Spanning tree Network flow Graph connectivity Maximum flow problem Randomized algorithm Minimum spanning tree Connectivity Cut SL Theoretical computer science Graph theory Mathematics
67	Seeking Stable Clusters in the Blogosphere Nilesh Bansal Fei Chiang University of Toronto Add to Reading List Source URL: www.blogscope.net Language: English - Date: 2012-04-10 15:02:30 Search algorithms Network flow Depth-first search Breadth-first search Correlation clustering Maximum flow problem Flow network Tree Connectivity Graph theory Mathematics Combinatorics
68	FD-MMAC: Combating Multi-Channel Hidden and Exposed Terminals Using a Single Transceiver Yan Zhang, Loukas Lazos, Kai Chen, Bocan Hu, and Swetha Shivaramaiah Dept. of Electrical and Computer Engineering, University of Ar Add to Reading List Source URL: www2.engr.arizona.edu Language: English - Date: 2014-03-08 11:30:48 Technology Network performance Information theory Carrier sense multiple access with collision avoidance IEEE 802.11 Exposed node problem Throughput Traffic flow Channel Wireless networking Computing Telecommunications engineering
69	ICS 260 – Fall 2001 – First Midterm Name: ANSWER KEY Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2001-10-18 19:06:29 Network flow Network theory Maximum flow problem Flow network Shortest path problem Matching Petersen graph Graph Distance Graph theory Mathematics Theoretical computer science
70	PDF Document Add to Reading List Source URL: conferences.sigcomm.org Language: English - Date: 2009-07-22 15:11:41 Networks Algebraic graph theory Network analysis Small-world network Centrality Flow network Shortest path problem Complex network Clustering coefficient Graph theory Network theory Mathematics

UPDATE